Todd's low-complexity algorithm is a predictor-corrector path-following method
نویسندگان
چکیده
منابع مشابه
A Predictor-corrector Path-following Algorithm for Symmetric Optimization Based on Darvay's Technique
In this paper, we present a predictor-corrector path-following interior-point algorithm for symmetric cone optimization based on Darvay's technique. Each iteration of the algorithm contains a predictor step and a corrector step based on a modification of the Nesterov and Todd directions. Moreover, we show that the algorithm is well defined and that the obtained iteration bound is √ log , where ...
متن کاملA Predictor-Corrector Path-Following Algorithm for Dual-Degenerate Parametric Optimization Problems
Most path-following algorithms for tracing a solution path of a parametric nonlinear optimization problem are only certifiably convergent under strong regularity assumptions about the problem functions, in particular, the linear independence of the constraint gradients at the solutions, which implies a unique multiplier solution for every nonlinear program. In this paper we propose and prove co...
متن کاملA non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
We present a predictor{corrector non{interior path following algorithm for the monotone linear complementarity problem based on Chen{Harker{Kanzow{Smale smoothing techniques. Although the method is modeled on the interior point predictor{ corrector strategies, it is the rst instance of a non{interior point predictor{corrector algorithm. The algorithm is shown to be both globally linearly conver...
متن کاملCorrector-predictor arc-search interior-point algorithm for $P_*(kappa)$-LCP acting in a wide neighborhood of the central path
In this paper, we propose an arc-search corrector-predictor interior-point method for solving $P_*(kappa)$-linear complementarity problems. The proposed algorithm searches the optimizers along an ellipse that is an approximation of the central path. The algorithm generates a sequence of iterates in the wide neighborhood of central path introduced by Ai and Zhang. The algorithm does not de...
متن کاملA superlinearly convergent predictor-corrector method
An interior point method for monotone linear complementarity problems acting in a wide neighborhood of the central path is presented. The method has O( √ nL)iteration complexity and is superlinearly convergent even when the problem does not possess a strictly complementary solution.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 1992
ISSN: 0167-6377
DOI: 10.1016/0167-6377(92)90025-x